Constraint propagation on GPU: A case study for the AllDifferent constraint

نویسندگان

چکیده

Abstract The AllDifferent constraint is a fundamental tool in Constraint Programming. It naturally arises many problems, from puzzles to scheduling and routing applications. Such popularity has prompted an extensive literature on filtering propagation for this constraint. This paper investigates the use of General Processing Units (GPUs) accelerate propagation. In particular, presents efficient parallelization GPU, along with analysis different design implementation choices evaluation performance resulting system several benchmarks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Machine learning for constraint solver design -- A case study for the alldifferent constraint

Constraint solvers are complex pieces of software which require many design decisions to be made by the implementer based on limited information. These decisions affect the performance of the finished solver significantly [16]. Once a design decision has been made, it cannot easily be reversed, although a different decision may be more appropriate for a particular problem. We investigate using ...

متن کامل

The alldifferent Constraint: A Survey

The constraint of difference is known to the constraint programming community since Lauriere introduced Alice [11] in 1978. Since then, several solving strategies have been designed for this constraint. In this paper we give both a practical overview and an abstract comparison of these different strategies.

متن کامل

The AllDifferent Constraint with Precedences

We propose ALLDIFFPREC, a new global constraint that combines together an ALLDIFFERENT constraint with precedence constraints that strictly order given pairs of variables. We identify a number of applications for this global constraint including instruction scheduling and symmetry breaking. We give an efficient propagation algorithm that enforces bounds consistency on this global constraint. We...

متن کامل

Generalizing AllDifferent: The SomeDifferent Constraint

We introduce the SomeDifferent constraint as a generalization of AllDifferent. SomeDifferent requires that values assigned to some pairs of variables will be different. It has many practical applications. For example, in workforce management, it may enforce the requirement that the same worker is not assigned to two jobs which are overlapping in time. Propagation of the constraint for hyper-arc...

متن کامل

A Probabilistic Study of Bound Consistency for the Alldifferent Constraint

This paper introduces a mathematical model for bound consistency of the constraint AllDifferent. It allows us to compute the probability that the filtering algorithm effectively removes at least one value in the variable domains. A complete study of the bound consistency properties is then proposed. It identifies several behaviors depending on some macroscopic quantities related to the variable...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Logic and Computation

سال: 2023

ISSN: ['1465-363X', '0955-792X']

DOI: https://doi.org/10.1093/logcom/exad033